Deciding Morality of Graphs is NP-complete
نویسندگان
چکیده
In order to find a causal explanation for data presented in the form of covariance and con centration matrices it is necessary to decide if the graph formed by such associations is a projection of a directed acyclic graph ( dag). We show that the general problem of deciding whether such a dag exists is NP-complete.
منابع مشابه
Complete Problems for Monotone NP
We show that the problem of deciding whether a digraph has a Hamiltonian path between two specified vertices and the problem of deciding whether a given graph has a cubic subgraph are complete for monotone NP via monotone projection translations. We also show that the problem of deciding whether a uniquely partially orderable (resp. comparability) graph has a cubic subgraph is complete for NP v...
متن کاملTenacity and some other Parameters of Interval Graphs can be computed in polynomial time
In general, computation of graph vulnerability parameters is NP-complete. In past, some algorithms were introduced to prove that computation of toughness, scattering number, integrity and weighted integrity parameters of interval graphs are polynomial. In this paper, two different vulnerability parameters of graphs, tenacity and rupture degree are defined. In general, computing the tenacity o...
متن کاملNP-hardness results for partitioning graphs into disjoint cliques and a triangle-free subgraph
This paper investigates the computational complexity of deciding whether the vertices of a graph can be partitioned into a disjoint union of cliques and a triangle-free subgraph. This problem is known to be NP-complete on arbitrary graphs. We show that this problem remains NP-complete even when restricted to planar graphs and perfect graphs.
متن کاملOn P4-transversals of chordal graphs
A P4-transversal of a graph G is a set of vertices T which meets every P4 of G. A P4transversal T is called stable if there are no edges in the subgraph of G induced by T . It has been previously shown by Hoàng and Le that it is NP -complete to decide whether a comparability (and hence perfect) graph G has a stable P4-transversal. In the following we show that the problem is NP -complete for ch...
متن کاملPolar Permutation Graphs
Polar graphs generalise bipartite, cobipartite, and split graphs, and they constitute a special type of matrix partitions. A graph is polar if its vertex set can be partitioned into two, such that one part induces a complete multipartite graph and the other part induces a disjoint union of complete graphs. Deciding whether a given arbitrary graph is polar, is an NP-complete problem. Here we sho...
متن کامل